Comparative Action Sequence Analysis with Hidden Markov Models and Sequence Mining
نویسنده
چکیده
Computer-based learning environments produce a wealth of data on student learning interactions. This paper presents an exploratory data mining methodology for assessing and comparing students’ learning behaviors from these interaction traces. In the first phase of this methodology, hidden Markov models (HMMs) are generated to model learning behaviors of the student groups being compared (e.g., high versus low performers). In this paper, we supplement the HMM technique with a novel combination of sequence mining techniques to identify differentially frequent patterns (between the student groups) in a finergrained analysis. We demonstrate the complete methodology through the analysis of learning trace data from a recent middle school classroom study with the Betty’s Brain learning environment. The results illustrate the effectiveness of this exploratory methodology and suggest further refinements of the HMM generation and sequence mining techniques.
منابع مشابه
Improving Phoneme Sequence Recognition using Phoneme Duration Information in DNN-HSMM
Improving phoneme recognition has attracted the attention of many researchers due to its applications in various fields of speech processing. Recent research achievements show that using deep neural network (DNN) in speech recognition systems significantly improves the performance of these systems. There are two phases in DNN-based phoneme recognition systems including training and testing. Mos...
متن کاملA generalization of Profile Hidden Markov Model (PHMM) using one-by-one dependency between sequences
The Profile Hidden Markov Model (PHMM) can be poor at capturing dependency between observations because of the statistical assumptions it makes. To overcome this limitation, the dependency between residues in a multiple sequence alignment (MSA) which is the representative of a PHMM can be combined with the PHMM. Based on the fact that sequences appearing in the final MSA are written based on th...
متن کاملIMAGE SEGMENTATION USING GAUSSIAN MIXTURE MODEL
Stochastic models such as mixture models, graphical models, Markov random fields and hidden Markov models have key role in probabilistic data analysis. In this paper, we have learned Gaussian mixture model to the pixels of an image. The parameters of the model have estimated by EM-algorithm. In addition pixel labeling corresponded to each pixel of true image is made by Bayes rule. In fact, ...
متن کاملApplications of hidden Markov models for comparative gene structure prediction
Identifying the structure in genome sequences is one of the principal challenges in modern molecular biology, and comparative genomics offers a powerful tool. In this paper we introduce a hidden Markov model that allows a comparative analysis of multiple sequences related by a phylogenetic tree. The model integrates structure prediction methods for one sequence, statistical multiple alignment m...
متن کاملImage Segmentation using Gaussian Mixture Model
Abstract: Stochastic models such as mixture models, graphical models, Markov random fields and hidden Markov models have key role in probabilistic data analysis. In this paper, we used Gaussian mixture model to the pixels of an image. The parameters of the model were estimated by EM-algorithm. In addition pixel labeling corresponded to each pixel of true image was made by Bayes rule. In fact,...
متن کامل